The elastic–viscous–plastic method revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The proximal point method revisited∗

In this short survey, I revisit the role of the proximal point method in large scale optimization. I focus on three recent examples: a proximally guided subgradient method for weakly convex stochastic approximation, the prox-linear algorithm for minimizing compositions of convex functions and smooth maps, and Catalyst generic acceleration for regularized Empirical Risk Minimization.

متن کامل

The Fermat factorization method revisited

We consider the well known Fermat factorization method, we call the Fermat factorization equation the equation solved by it: P(x, y) = (x+ 2R) − y − 4N = 0; where N = p q > 0 is a RSA modulus with primes p and q supposed of equal length. This equation is a bivariate integer polynomial equation and we propose to solve it directly using Coppersmith’s methods for bivariate integer polynomials. As ...

متن کامل

The GLOBAL optimization method revisited

The multistart clustering global optimization method called GLOBAL has been introduced in the 1980s for bound constrained global optimization problems with black-box type objective function. Since then the technological environment has been changed much. The present paper describes shortly the revisions and updates made on the involved algorithms to utilize the novel technologies, and to improv...

متن کامل

The subspace iteration method – Revisited

The objective in this paper is to present some recent developments regarding the subspace iteration method for the solution of frequencies and mode shapes. The developments pertain to speeding up the basic subspace iteration method by choosing an effective number of iteration vectors and by the use of parallel processing. The subspace iteration method lends itself particularly well to shared an...

متن کامل

Double Description Method Revisited

The double description method is a simple and useful algorithm for enumerating all extreme rays of a general polyhedral cone in IR d , despite the fact that we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for eecient implementations, and show some empirical results indicating its practicality ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ocean Modelling

سال: 2013

ISSN: 1463-5003

DOI: 10.1016/j.ocemod.2013.05.013